On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas
نویسندگان
چکیده
In this paper, we analyze 2CNF formulas from the perspectives of Read-Once resolution (ROR) refutation schemes. We focus on two types of ROR refutations, viz., variable-once refutation and clause-once refutation. In the former, each variable may be used at most once in the derivation of a refutation, while in the latter, each clause may be used at most once. We show that the problem of checking whether a given 2CNF formula has an ROR refutation under both schemes is NP-complete. This is surprising in light of the fact that there exist polynomial refutation schemes (tree-resolution and DAG-resolution) for 2CNF formulas. On the positive side, we show that 2CNF formulas have copy-complexity 2, which means that any unsatisfiable 2CNF formula has a refutation in which any clause needs to be used at most twice.
منابع مشابه
Computational Complexity of Learning Read-once Formulas over Diierent Bases
We study computational complexity of learning read-once formulas over diierent boolean bases. In particular we design a polynomial time algorithm for learning read-once formulas over a threshold basis. The algorithm works in time O(n 3) using O(n 3) membership queries. By the result of Angluin, Heller-stein, Karpinski, 1989] on the corresponding unate class of boolean functions, this gives a po...
متن کاملComplete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas
In this paper we study the identity testing problem of arithmetic read-once formulas (ROF) and some related models. A read-once formula is formula (a circuit whose underlying graph is a tree) in which the operations are {+,×} and such that every input variable labels at most one leaf. We obtain the first polynomial-time deterministic identity testing algorithm that operates in the black-box set...
متن کاملOn the Complexity of the CQF Hierarchy
where allRi and S are formulas in conjunctive normal form (CNF), and where in general all CNF formulas occurring in Fi contain the variable set Qi Each formula Fi is a Constrained Quantified Formula (CQF). For a given i ≥ 1, the problem of evaluating formula Fi is called CQF(i). Note that CQF(i) is at the ith complexity level of the polynomial hierarchy. In particular, CQF(i) is ΣPi complete if...
متن کاملNP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal–once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Literal–once resolution refutations can be found nondeterministically in polynomial time, though this restricted system is not complete. We show that despite of the weakness of literal–once resolution, the recognition o...
متن کاملIsomorphism testing of read-once functions and polynomials
In this paper, we study the isomorphism testing problem of formulas in the Boolean and arithmetic settings. We show that isomorphism testing of Boolean formulas in which a variable is read at most once (known as read-once formulas) is complete for log-space. In contrast, we observe that the problem becomes polynomial time equivalent to the graph isomorphism problem, when the input formulas can ...
متن کامل